ebab7d0da53c51438720d60c6e2e467c - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Creative Computing Benchmark</title>

</head>

Creative Computing Benchmark

</h1>

</header>

The Creative Computing Benchmark, also called Ahl's Simple Benchmark, is a <a href="Benchmark_(computing)" title="Benchmark (computing)">computer benchmark</a> that was used to compare the performance of the <a href="BASIC" title="BASIC">BASIC</a> programming language on various machines. It was first introduced in the November 1983 issue of <a href="Creative_Computing_(magazine)" title="Creative Computing (magazine)">Creative Computing</a> magazine with the measures from a number of <a href="8-bit" class="mw-redirect" title="8-bit">8-bit computers</a> that were popular at the time. Over a period of a few months, the list was greatly expanded to include practically every contemporary machine, topped by the <a href="Cray-1" title="Cray-1">Cray-1</a> supercomputer, which ran it in 0.01 seconds.<a href="#cite_note-2">[a]</a>

The Creative Computing Benchmark was one of three common benchmarks of the era. Its primary competition in the early 1980s in the United States was the <a href="Byte_Sieve" title="Byte Sieve">Byte Sieve</a>, of September 1981, while the earlier <a href="Rugg/Feldman_benchmarks" title="Rugg/Feldman benchmarks">Rugg/Feldman benchmarks</a> of June 1977 were not as well known in the United States, but were widely used in the United Kingdom.

<div class="mw-heading mw-heading2"><h2 id="History">History</h2></div>

The benchmark first appeared in the November 1983 issue of Creative Computing under the title "Benchmark Comparison Test".<a href="#cite_note-FOOTNOTEAhl1983259-3">[2]</a> In the article, author <a href="David_H._Ahl" title="David H. Ahl">David H. Ahl</a> was careful to state that it tested only a few aspects of the BASIC language, mostly its looping performance. He stated:

/* start https://en.wikipedia.org/ */

.mw-parser-output .templatequote{overflow:hidden;margin:1em 0;padding:0 32px}.mw-parser-output .templatequotecite{line-height:1.5em;text-align:left;margin-top:0}@media(min-width:500px){.mw-parser-output .templatequotecite{padding-left:1.6em}}

/* end https://en.wikipedia.org/ */

</style><blockquote class="templatequote">... the benchmark program presented here is not representative of the way computers are actually used; it measures only a few aspects of performance, and no one should buy a computer based solely on the results of these measures. Yet, the results provide some interesting comparative data.<a href="#cite_note-FOOTNOTEAhl1983259-3">[2]</a></blockquote>

The initial results were provided for common machines of the era, including the <a href="Apple_II" title="Apple II">Apple II</a>, <a href="Commodore_64" title="Commodore 64">Commodore 64</a> and the recently released <a href="IBM_Personal_Computer" title="IBM Personal Computer">IBM Personal Computer</a>. Most of these machines ran some variation of the stock <a href="Microsoft_BASIC" title="Microsoft BASIC">Microsoft BASIC</a> and thus provided similar times on the order of two minutes, while the <a href="16-bit" class="mw-redirect" title="16-bit">16-bit</a> PC was near the top of the list at only 24 seconds. the fastest machine in this initial suite was the <a href="Olivetti_M20" title="Olivetti M20">Olivetti M20</a> at 13 seconds, and the slowest was <a href="Atari_BASIC" title="Atari BASIC">Atari BASIC</a> on the <a href="Atari_8-bit_computers" title="Atari 8-bit computers">Atari 8-bit computers</a> at 6 minutes 58 seconds.<a href="#cite_note-FOOTNOTEAhl1983260-4">[3]</a>

In the months following its publication, the magazine was inundated with results for other platforms. It became a regular feature for a time, placed prominently near the front of the magazine with an ever-growing list of results. By March the fastest machine on the list was the Cray-1 at 0.01 seconds, and the slowest was the <a href="TI_SR-50" title="TI SR-50">TI SR-50</a> <a href="Programmable_calculator" title="Programmable calculator">programmable calculator</a> at 12.7 days.<a href="#cite_note-FOOTNOTEAhl19847-5">[4]</a>

The benchmark had several problems that made it less useful for general purposes. For instance, the system did not test any string manipulation, whose performance varied widely across platforms. It also did not take advantage of any "speedups" available on different platforms, like the possible use of integer variables for loop indexes or turning off video access on machines with shared main memory.<a href="#cite_note-7">[b]</a> These limitations were widely debated at the time.<a href="#cite_note-FOOTNOTEWilkinson1985139-8">[6]</a> The November 1983 article stipulated using an "accurate stopwatch" to time the program execution on machines lacking a real-time clock: When applied to the faster machines, this would yield test results highly dependent on the reaction time of the individual operating the stopwatch.

Its last appearance is in the May 1984 issue, which included values for 183 machines. This issue included a note that the many criticisms of the system had been taken to heart and a new benchmark program was under design.<a href="#cite_note-FOOTNOTEAhl19846-9">[7]</a> However, such a program never appeared in the magazine. In the September 1985 issue, David Ahl responded to a Letter to the Editor about the new benchmark program with "Several analysts spent many hours working out three new benchmark tests ... none gave different or better results".<a href="#cite_note-10">[8]</a>

The benchmark continued to be used as a general-purpose tool after this date,<a href="#cite_note-11">[9]</a> but as the importance of BASIC dwindled it became less common.

This is the original version from the November 1983 edition:<a href="#cite_note-FOOTNOTEAhl1983259-3">[2]</a>

<div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>1 ' Ahl's simple benchmark test

2 ' In Lines 30 and 40, some computers

3 ' may require RND(1) for correct results

10 PRINT "Accuracy Random"

20 FOR N=1 TO 100:A=N

30 FOR I=1 TO 10:A=SQR(A):R=R+RND(0):NEXT I

40 FOR I=1 TO 10:A=A^2:R=R+RND(0):NEXT I

50 S=S+A:NEXT N

60 PRINT ABS(1010-S/5);ABS(1000-R)

</pre></div>

The following is from later versions of the benchmark code, which reduced the number of compound statements on a line:<a href="#cite_note-FOOTNOTEAhl19847-5">[4]</a><a href="#cite_note-12">[c]</a>

<div class="mw-highlight mw-highlight-lang-basic mw-content-ltr" dir="ltr"><pre>10 ' Ahl's Simple Benchmark

20 FOR N=1 TO 100: A=N

40 A=SQR(A): R=R+RND(1)

50 NEXT I

60 FOR I=1 TO 10

70 A=A^2: R=R+RND(1)

80 NEXT I

90 S=S+A: NEXT N

100 PRINT ABS(1010-S/5)

110 PRINT ABS(1000-R)

</pre></div>

<div class="mw-heading mw-heading2"><h2 id="Notes">Notes</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist reflist-lower-alpha">

<li id="cite_note-2"><a href="#cite_ref-2">^</a> Cray did not produce a BASIC for the Cray-1, so it is not clear in what language this version was written.<a href="#cite_note-1">[1]</a>

</li>

<li id="cite_note-7"><a href="#cite_ref-7">^</a> Most 8-bit machines of the era had a single bank of RAM that was shared between the CPU and display driver, which led to <a href="Bus_contention" title="Bus contention">bus contention</a> issues that slowed performance as much as 30%. Turning off the display was a common way to improve compute-bound programs like this benchmark.<a href="#cite_note-FOOTNOTEWilkinson1985140-6">[5]</a>

</li>

<li id="cite_note-12"><a href="#cite_ref-12">^</a> Likely to reduce the line length below 40 characters for all lines. In the original version, line 30 is 43 characters long.

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

<div class="mw-heading mw-heading3"><h3 id="Citations">Citations</h3></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite class="citation book cs1"><a rel="nofollow" class="external text" href="http://bitsavers.trailing-edge.com/pdf/cray/COS/T-0103C-CRAY_1_Computer_System-Operating_System_COS_Workbook-Training-September_1981.OCR.pdf">CRAY-1 Computer Operating System Handbook</a> (PDF). Cray Computer. September 1981.</cite>

</li>

<li id="cite_note-FOOTNOTEAhl1983259-3">^ <a href="#cite_ref-FOOTNOTEAhl1983259_3-0">a</a> <a href="#cite_ref-FOOTNOTEAhl1983259_3-1">b</a> <a href="#cite_ref-FOOTNOTEAhl1983259_3-2">c</a> <a href="#CITEREFAhl1983">Ahl 1983</a>, p. 259.

</li>

<li id="cite_note-FOOTNOTEAhl1983260-4"><a href="#cite_ref-FOOTNOTEAhl1983260_4-0">^</a> <a href="#CITEREFAhl1983">Ahl 1983</a>, p. 260.

</li>

<li id="cite_note-FOOTNOTEAhl19847-5">^ <a href="#cite_ref-FOOTNOTEAhl19847_5-0">a</a> <a href="#cite_ref-FOOTNOTEAhl19847_5-1">b</a> <a href="#CITEREFAhl1984">Ahl 1984</a>, p. 7.

</li>

<li id="cite_note-FOOTNOTEWilkinson1985140-6"><a href="#cite_ref-FOOTNOTEWilkinson1985140_6-0">^</a> <a href="#CITEREFWilkinson1985">Wilkinson 1985</a>, p. 140.

</li>

<li id="cite_note-FOOTNOTEWilkinson1985139-8"><a href="#cite_ref-FOOTNOTEWilkinson1985139_8-0">^</a> <a href="#CITEREFWilkinson1985">Wilkinson 1985</a>, p. 139.

</li>

<li id="cite_note-FOOTNOTEAhl19846-9"><a href="#cite_ref-FOOTNOTEAhl19846_9-0">^</a> <a href="#CITEREFAhl1984">Ahl 1984</a>, p. 6.

</li>

<li id="cite_note-10"><a href="#cite_ref-10">^</a> <cite id="CITEREFAhl1985" class="citation magazine cs1">Ahl, David (September 1985). <a rel="nofollow" class="external text" href="https://archive.org/details/creativecomputing-1985-09/page/n7">"Input/Output"</a>. Creative Computing. p. 6.</cite>

</li>

<li id="cite_note-11"><a href="#cite_ref-11">^</a> <cite id="CITEREFHart1985" class="citation magazine cs1">Hart, Glenn (May 1985). <a rel="nofollow" class="external text" href="https://archive.org/stream/creativecomputing-1985-05/Creative_Computing_v11_n05_1985_May#page/n55">"Microsoft BASIC 2.0 for the Mac"</a>. Creative Computing. pp. 46, 48, 51–52.</cite>

</li>

</ol></div>

<div class="mw-heading mw-heading3"><h3 id="Bibliography">Bibliography</h3></div>

<ul><li><cite id="CITEREFAhl1983" class="citation magazine cs1">Ahl, David (November 1983). <a rel="nofollow" class="external text" href="https://archive.org/details/creativecomputing-1983-11/page/n269">"Benchmark Comparison Test"</a>. Creative Computing. pp. 259–260.</cite></li>

<li><cite id="CITEREFAhl1984" class="citation magazine cs1">Ahl, David (March 1984). <a rel="nofollow" class="external text" href="https://archive.org/details/creativecomputing-1984-03/page/n7">"Creative Computing Benchmark"</a>. Creative Computing. p. 6.</cite></li>

<li><cite id="CITEREFWilkinson1985" class="citation magazine cs1">Wilkinson, Bill (February 1985). <a rel="nofollow" class="external text" href="https://archive.org/stream/1985-02-compute-magazine/Compute_Issue_057_1985_Feb#page/n139/">"INSIGHT: Atari"</a>. Compute!. pp. 139–142.</cite></li></ul></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-06-09" href="https://en.wikipedia.org/wiki/?title=Creative_Computing_Benchmark&oldid=1294674760">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>